Methods and systems for carpooling

ABSTRACT

The present disclosure relates to systems and methods for carpooling. The systems may perform the methods to obtain a first transaction request associated with a first transportation service of a first service receiver at a first time point; obtain a second transaction request associated with a second transportation service of a second service receiver at a second time point; obtain service provider information of a service provider; determine an assignment strategy associated with combining the first transportation service and the second transportation service into a third transportation service according to at least one of the first transaction request, the second transaction request, or the service provider information; and send the assignment strategy to at least one of the first service receiver, the second service receiver or the service provider.

CROSS-REFERENCE TO RELATED APPLICATIONS

This present application is a continuation of International ApplicationNo. PCT/CN2016/107351, filed on Nov. 25, 2016, which claims priority ofChinese Patent Application No. 201610100973.1 filed Feb. 24, 2016,Chinese Patent Application No. 201610143434.6 filed Mar. 14, 2016,Chinese Patent Application No. 201610157715.7 filed Mar. 18, 2016 andChinese Patent Application No. 201610171397.X filed Mar. 23, 2016, thecontents of which are hereby incorporated by reference to theirentirety.

TECHNICAL FIELD

The present disclosure generally relates to an on-demand service system,and more particularly, to methods and systems for carpooling.

BACKGROUND

A carpool service refers to an arrangement that combines two or moretransportation services into a new transportation service. The carpoolservice may improve the traffic capacity. However, there are someproblems such as inefficiency and a bad user experience in existingsystems and methods for carpooling. Therefore, it is desirable toprovide systems and methods for carpooling to improve the efficiency andthe user experience.

SUMMARY

According to an aspect of the present disclosure, a system may includeone or more storage media and one or more processors configured tocommunicate with the one or more storage media. The one or more storagemedia may include a set of instructions for carpooling. When the one ormore processors executing the set of instructions, the one or moreprocessors may be directed to perform one or more of the followingoperations. The one or more processors may obtain a first transactionrequest associated with a first transportation service of a firstservice receiver at a first time point. The one or more processors mayobtain a second transaction request associated with a secondtransportation service of a second service receiver at a second timepoint. The one or more processors may obtain service providerinformation of a service provider. The one or more processors maydetermine an assignment strategy associated with combining the firsttransportation service and the second transportation service into athird transportation service according to at least one of the firsttransaction request, the second transaction request, and/or the serviceprovider information. The one or more processors may send the assignmentstrategy to at least one of the first service receiver, the secondservice receiver and/or the service provider.

In some embodiments, the first transaction request may include at leastone of a first origin and/or a first destination, the second transactionrequest may include at least one of a second origin and/or a seconddestination, and the service provider information may include at leastone of a first location of the service provider at the first time pointand/or a second location of the service provider at the second timepoint.

In some embodiments, the one or more processors may determine matchinginformation according to at least one of the first transaction request,the second transaction request, and/or the service provider information.The matching information may include at least one of a variation in atravel direction of the service provider which has accepted the firsttransaction request when the service provider goes to the second originof the second transaction request, direction information, routeinformation, a matching probability, and/or a ratio between an estimatedtravel time associated with the third transportation service and anestimated travel time associated with the first transportation service.The one or more processors may determine a matching result according tothe matching information. The one or more processors may determine aranking result according to the matching result. The one or moreprocessors may determine an assignment strategy according to the rankingresult.

In some embodiments, the one or more processors may determine thedirection information and the route information according to the firsttransaction request and the second transaction request.

In some embodiments, the one or more processors may determine a firstdirection of the first transaction request according to the first originand the first destination, a second direction of the second transactionrequest according to the second origin and the second destination, afirst sharing route of the first transaction request, a second sharingroute of the second transaction request, a first original route of thefirst transaction request and a second original route of the secondtransaction request, wherein the first sharing route may be a route fromthe first origin to the first destination in the third transportationservice, and the second sharing route may be a route from the secondorigin to the second destination in the third transportation service.The one or more processors may determine a length of the first sharingroute, a length of the second sharing route, a length of the firstoriginal route and a length of the second original route. The one ormore processors may determine a first angel between the first directionand the second direction, a second ratio of the length of the firstsharing route to the length of the first original route and a thirdratio of the length of the second sharing route to the length of thesecond original route.

In some embodiments, when the second transaction request of the secondservice receiver is obtained at the second time point, the firsttransaction request of the first service receiver may have been acceptedby the service provider.

In some embodiments, the one or more processors may determine a firstroute according to the second location of the service provider at thesecond time point and the first destination of the first transactionrequest. The one or more processors may determine a second routeaccording to the second origin of the second transaction request and thesecond destination of the second transaction request. The one or moreprocessors may determine the variation in the travel direction of theservice provider which has accepted the first transaction request whenthe service provider goes to the second origin of the second transactionrequest according to the first route and the second route.

In some embodiments, the one or more processors may determine a thirdroute according to the second origin and the second destination and afourth route according to the second location of the service provider atthe second time point and the first destination. The one or moreprocessors may obtain a first parameter according to the third route andthe fourth route. The one or more processors may obtain a providerweight. The one or more processors may determine a matching probabilityaccording to the first parameter and the provider weight.

In some embodiments, the first parameter may include at least one of adistance between the second location of the service provider and thefirst origin, a distance between the second location of the serviceprovider and the first destination, a second angle between the thirdroute and the fourth route, a fourth ratio of a length of a thirdsharing route of the first transaction request to a length of a thirdoriginal route, and/or a fifth ratio of a length of a fourth sharingroute to a length of a fourth original route.

In some embodiments, the one or more processors may obtain a thirdtransaction request associated with a fourth transportation service anda fourth transaction request associated with a fifth transportationservice, wherein the third transportation service and the fourthtransportation service may be combined into a sixth transportationservice that has been completed by the service provider. The one or moreprocessors may obtain a second parameter according to the thirdtransaction request and the fourth transaction request. The one or moreprocessors may determine the provider weight according to the secondparameter.

In some embodiments, the one or more processors may determine a fourthroute according to the first location of the service provider, the firstorigin and the first destination. The one or more processors maydetermine a first estimated time of the fourth route. The one or moreprocessors may determine a fifth route according to at least one of thesecond location of the service provider, the second origin, the seconddestination, the first origin and/or the first destination. The one ormore processors may determine a second estimated time of the fifthroute. The one or more processors may determine the first ratio of thesecond estimated time to the first estimated time.

According to another aspect of the present disclosure, a method mayinclude one or more of the following operations. A computer server of anonline on-demand transportation service platform may obtain a firsttransaction request associated with a first transportation service of afirst service receiver at a first time point. The computer server mayobtain a second transaction request associated with a secondtransportation service of a second service receiver at a second timepoint. The computer server may obtain service provider information of aservice provider. The computer server may determine an assignmentstrategy associated with combining the first transportation service andthe second transportation service into a third transportation serviceaccording to at least one of the first transaction request, the secondtransaction request and/or the service provider information. Thecomputer server may send the assignment strategy to at least one of thefirst service receiver, the second service receiver and/or the serviceprovider.

In some embodiments, the first transaction request may include at leastone of a first origin or a first destination, the second transactionrequest may include at least one of a second origin or a seconddestination, and the service provider information may include at leastone of a first location of the service provider at the first time pointand/or a second location of the service provider at the second timepoint.

In some embodiments, the computer server may determine matchinginformation according to at least one of the first transaction request,the second transaction request and/or the service provider information.The matching information may include at least one of a variation in atravel direction of the service provider which has accepted the firsttransaction request when the service provider goes to the second originof the second transaction request, direction information, routeinformation, a matching probability, and/or a ratio between an estimatedtravel time associated with the third transportation service and anestimated travel time associated with the first transportation service.The computer server may generate a matching result according to thematching information. The computer server may generate a ranking resultaccording to the matching result. The computer server may generate anassignment strategy according to the ranking result.

In some embodiments, the computer server may determine the directioninformation and the route information according to the first transactionrequest and the second transaction request.

In some embodiments, the computer server may determine a first directionof the first transaction request according to the first origin and thefirst destination, a second direction of the second transaction requestaccording to the second origin and the second destination, a firstsharing route of the first transaction request, a second sharing routeof the second transaction request, a first original route of the firsttransaction request and a second original route of the secondtransaction request, wherein the first sharing route may be a route fromthe first origin to the first destination in the third transportationservice, and the second sharing route may be a route from the secondorigin to the second destination in the third transportation service.The computer server may determine a length of the first sharing route, alength of the second sharing route, a length of the first original routeand a length of the second original route. The computer server maydetermine a first angel between the first direction and the seconddirection, a second ratio of the length of the first sharing route tothe length of the first original route and a third ratio of the lengthof the second sharing route to the length of the second original route.

In some embodiments, when the second transaction request of the secondservice receiver is obtained at the second time point, the firsttransaction request of the first service receiver may have been acceptedby the service provider.

In some embodiments, the computer server may determine a first routeaccording to the second location of the service provider at the secondtime point and the first destination of the first transaction request.The computer server may determine a second route according to the secondorigin of the second transaction request and the second destination ofthe second transaction request. The computer server may determine thevariation in the travel direction of the service provider which hasaccepted the first transaction request when the service provider goes tothe second origin of the second transaction request according to thefirst route and the second route.

In some embodiments, the computer server may determine a third routeaccording to the second origin and the second destination and a fourthroute according to the second location of the service provider at thesecond time point and the first destination. The computer server mayobtain a first parameter according to the third route and the fourthroute. The computer server may obtain a provider weight. The computerserver may determine a matching probability according to the firstparameter and the provider weight.

In some embodiments, the first parameter may include at least one of adistance between the second location of the service provider and thefirst origin, a distance between the second location of the serviceprovider and the first destination, a second angle between the thirdroute and the fourth route, a fourth ratio of a length of a thirdsharing route of the first transaction request to a length of a thirdoriginal route, and/or a fifth ratio of a length of a fourth sharingroute to a length of a fourth original route.

In some embodiments, the computer server may obtain a third transactionrequest associated with a fourth transportation service and a fourthtransaction request associated with a fifth transportation service. Thethird transportation service and the fourth transportation service maybe combined into a sixth transportation service that has been completedby the service provider. The computer server may obtain a secondparameter according to the third transaction request and the fourthtransaction request. The computer server may determine the providerweight according to the second parameter.

In some embodiments, the computer server may determine a fourth routeaccording to the first location of the service provider, the firstorigin and the first destination. The computer server may determine afirst estimated time of the fourth route. The computer server maydetermine a fifth route according to at least one of the second locationof the service provider, the second origin, the second destination, thefirst origin and/or the first destination. The computer server maydetermine a second estimated time of the fifth route. The computerserver may determine the first ratio of the second estimated time to thefirst estimated time.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an exemplary on-demand service system 100according to some embodiments.

FIG. 2 is a schematic diagram illustrating exemplary hardware andsoftware components of a computing device 200 according to someembodiments of the present disclosure.

FIG. 3 is a block diagram illustrating an exemplary architecture ofprocessing engine 112 according to some embodiments of the presentdisclosure.

FIG. 4 is a flowchart illustrating an exemplary process of a carpoolservice according to some embodiments of the present disclosure.

FIG. 5 is a block diagram illustrating an exemplary architecture of anassignment strategy generation unit 330 according to some embodiments ofthe present disclosure.

FIG. 6 is a flowchart illustrating an exemplary process of generating anassignment strategy according to some embodiments of the presentdisclosure.

FIG. 7 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure.

FIG. 8 and FIG. 9 are exemplary diagrams illustrating a variation of thetravel direction of a service provider according to some embodiments ofthe present disclosure.

FIG. 10 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure.

FIG. 11 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure.

FIG. 12 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure.

FIG. 13 is a flowchart illustrating an exemplary process of obtaining aprovider weight according to some embodiments of the present disclosure.

FIG. 14 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure.

FIG. 15 is an exemplary diagram showing a fifth route and a sixth routeaccording to some embodiments of the present disclosure.

DETAILED DESCRIPTION

The following description is presented to enable any person skilled inthe art to make and use the present disclosure, and is provided in thecontext of a particular application and its requirements. Variousmodifications to the disclosed embodiments will be readily apparent tothose skilled in the art, and the general principles defined herein maybe applied to other embodiments and applications without departing fromthe spirit and scope of the present disclosure. Thus, the presentdisclosure is not limited to the embodiments shown, but is to beaccorded the widest scope consistent with the claims.

The terminology used herein is for the purpose of describing particularexample embodiments only and is not intended to be limiting. As usedherein, the singular forms “a,” “an,” and “the” may be intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprise,”“comprises,” and/or “comprising,” “include,” “includes,” and/or“including,” when used in this specification, specify the presence ofstated features, integers, steps, operations, elements, and/orcomponents, but do not preclude the presence or addition of one or moreother features, integers, steps, operations, elements, components,and/or groups thereof.

These and other features, and characteristics of the present disclosure,as well as the methods of operation and functions of the relatedelements of structure and the combination of parts and economies ofmanufacture, may become more apparent upon consideration of thefollowing description with reference to the accompanying drawings, allof which form a part of this disclosure. It is to be expresslyunderstood, however, that the drawings are for the purpose ofillustration and description only and are not intended to limit thescope of the present disclosure. It is understood that the drawings arenot to scale.

The flowcharts used in the present disclosure illustrate operations thatsystems implement according to some embodiments in the presentdisclosure. It is to be expressly understood, the operations of theflowchart may be implemented not in order. Conversely, the operationsmay be implemented in inverted order, or simultaneously. Moreover, oneor more other operations may be added to the flowcharts. One or moreoperations may be removed from the flowcharts.

Moreover, while the system and method in the present disclosure isdescribed primarily in regard to allocate a set of sharable orders, itshould also be understood that this is only one exemplary embodiment.The system or method of the present disclosure may be applied to anyother kind of on demand service. For example, the system or method ofthe present disclosure may be applied to transportation systems ofdifferent environments including land, ocean, aerospace, or the like, orany combination thereof. The vehicle of the transportation systems mayinclude a taxi, a private car, a hitch, a bus, a train, a bullet train,a high speed rail, a subway, a vessel, an aircraft, a spaceship, ahot-air balloon, a driverless vehicle, or the like, or any combinationthereof. The transportation system may also include any transportationsystem for management and/or distribution, for example, a system forsending and/or receiving an express. The application of the system ormethod of the present disclosure may include a webpage, a plug-in of abrowser, a client terminal, a custom system, an internal analysissystem, an artificial intelligence robot, or the like, or anycombination thereof.

The term “passenger,” “requester,” “service requester,” and “customer”in the present disclosure are used interchangeably to refer to anindividual, an entity or a tool that may request or order a service.Also, the term “driver,” “provider,” “service provider,” and “supplier”in the present disclosure are used interchangeably to refer to anindividual, an entity or a tool that may provide a service or facilitatethe providing of the service. The term “user” in the present disclosuremay refer to an individual, an entity or a tool that may request aservice, order a service, provide a service, or facilitate the providingof the service. For example, the user may be a passenger, a driver, anoperator, or the like, or any combination thereof. In the presentdisclosure, “passenger” and “passenger terminal” may be usedinterchangeably, and “driver” and “driver terminal” may be usedinterchangeably.

The term “service request” and “order” in the present disclosure areused interchangeably to refer to a request that may be initiated by apassenger, a requester, a service requester, a customer, a driver, aprovider, a service provider, a supplier, or the like, or anycombination thereof. The service request may be accepted by any one of apassenger, a requester, a service requester, a customer, a driver, aprovider, a service provider, or a supplier. The service request may bechargeable or free.

The positioning technology used in the present disclosure may be basedon a global positioning system (GPS), a global navigation satellitesystem (GLONASS), a compass navigation system (COMPASS), a Galileopositioning system, a quasi-zenith satellite system (QZSS), a wirelessfidelity (WiFi) positioning technology, or the like, or any combinationthereof. One or more of the above positioning systems may be usedinterchangeably in the present disclosure.

An aspect of the present disclosure relates to online systems andmethods for finding sharable and/or combinable transportationtransactions, such as carpooling. The systems and methods may do so bydetermining matching information of a plurality of orders, determining aset of sharable orders based on the matching information, and allocatinga set of sharable orders. The matching information may include at leastone of a variation in travel direction of the service provider which hasaccepted the first transaction request when the service provider goes toan origin of a transaction request, direction information, routeinformation, a matching probability or a ratio between an estimatedtravel time associated with the combined transportation service and anestimated travel time associated with the first transportation service.

It should be noted that online on-demand transportation service, such asonline carpool service, is a new form of service rooted only inpost-Internet era. It provides technical solutions to users and serviceproviders that could raise only in post-Internet era. In pre-Internetera, when a user hails a taxi on street, the taxi request and acceptanceoccur only between the passenger and one taxi driver that sees thepassenger. If the passenger hails a taxi through telephone call, theservice request and acceptance may occur only between the passenger andone service provider (e.g., one taxi company or agent). If a driverwants to provider a carpool service, the driver has to ask a passengerface to face and determine whether the carpooling service is possible tobe provided to the passenger by experience of the driver. Online carpoolservice, however, obtains transaction requests and finds combinabletransaction requests in real-time and automatically. The carpool servicealso allows a user of the service to real-time and automatic distributea service request to a vast number of individual service providers(e.g., taxi) distance away from the user and allows a plurality ofservice provides to respond to the service request simultaneously and inreal-time. Therefore, through Internet, the online on-demandtransportation systems may provide a much more efficient transactionplatform for the users and the service providers that may never met in atraditional pre-Internet transportation service system.

FIG. 1 is a block diagram of an exemplary on-demand service system 100according to some embodiments. For example, the on-demand service system100 may be an online transportation service platform for transportationservices such as taxi hailing, chauffeur service, express car, carpool,bus service, driver hire and shuttle service. The on-demand servicesystem 100 may be an online platform including a server 110, a network120, a requestor terminal 130, a provider terminal 140, and a database150. The server 110 may include a processing engine 112.

In some embodiments, the server 110 may be a single server, or a servergroup. The server group may be centralized, or distributed (e.g., server110 may be a distributed system). In some embodiments, the server 110may be local or remote. For example, the server 110 may accessinformation and/or data stored in the requestor terminal 130, theprovider terminal 140, and/or the database 150 via the network 120. Asanother example, the server 110 may be directly connected to therequestor terminal 130, the provider terminal 140, and/or the database150 to access stored information and/or data. In some embodiments, theserver 110 may be implemented on a cloud platform. Merely by way ofexample, the cloud platform may include a private cloud, a public cloud,a hybrid cloud, a community cloud, a distributed cloud, an inter-cloud,a multi-cloud, or the like, or any combination thereof. In someembodiments, the server 110 may be implemented on a computing device 200having one or more components illustrated in FIG. 2 in the presentdisclosure.

In some embodiments, the server 110 may include a processing engine 112.The processing engine 112 may process information and/or data relatingto the service request to perform one or more functions described in thepresent disclosure. For example, the processing engine 112 may determinea target vehicle based on the service request obtained from therequestor terminal 130. In some embodiments, the processing engine 112may include one or more processing engines (e.g., single-core processingengine(s) or multi-core processor(s)). Merely by way of example, theprocessing engine 112 may include a central processing unit (CPU), anapplication-specific integrated circuit (ASIC), an application-specificinstruction-set processor (ASIP), a graphics processing unit (GPU), aphysics processing unit (PPU), a digital signal processor (DSP), a fieldprogrammable gate array (FPGA), a programmable logic device (PLD), acontroller, a microcontroller unit, a reduced instruction-set computer(RISC), a microprocessor, or the like, or any combination thereof.

The network 120 may facilitate exchange of information and/or data. Insome embodiments, one or more components in the on-demand service system100 (e.g., the server 110, the requestor terminal 130, the providerterminal 140, and the database 150) may send information and/or data toother component(s) in the on-demand service system 100 via the network120. For example, the server 110 may obtain/acquire service request fromthe requestor terminal 130 via the network 120. In some embodiments, thenetwork 120 may be any type of wired or wireless network, or combinationthereof. Merely by way of example, the network 130 may include a cablenetwork, a wireline network, an optical fiber network, a telecommunications network, an intranet, an Internet, a local area network(LAN), a wide area network (WAN), a wireless local area network (WLAN),a metropolitan area network (MAN), a wide area network (WAN), a publictelephone switched network (PSTN), a Bluetooth network, a ZigBeenetwork, a near field communication (NFC) network, or the like, or anycombination thereof. In some embodiments, the network 120 may includeone or more network access points. For example, the network 120 mayinclude wired or wireless network access points such as base stationsand/or internet exchange points 120-1, 120-2, . . . , through which oneor more components of the on-demand service system 100 may be connectedto the network 120 to exchange data and/or information.

In some embodiments, a requestor may be a user of the requestor terminal130. In some embodiments, the user of the requestor terminal 130 may besomeone other than the requestor. For example, a user A of the requestorterminal 130 may use the requestor terminal 130 to send a servicerequest for a user B, or receive service and/or information orinstructions from the server 110. In some embodiments, a provider may bea user of the provider terminal 140. In some embodiments, the user ofthe provider terminal 140 may be someone other than the provider. Forexample, a user C of the provider terminal 140 may user the providerterminal 140 to receive a service request for a user D, and/orinformation or instructions from the server 110. In some embodiments,“requestor” and “requestor terminal” may be used interchangeably, and“provider” and “provider terminal” may be used interchangeably.

In some embodiments, the requestor terminal 130 may include a mobiledevice 130-1, a tablet computer 130-2, a laptop computer 130-3, abuilt-in device in a motor vehicle 130-4, or the like, or anycombination thereof. In some embodiments, the mobile device 130-1 mayinclude a smart home device, a wearable device, a smart mobile device, avirtual reality device, an augmented reality device, or the like, or anycombination thereof. In some embodiments, the smart home device mayinclude a smart lighting device, a control device of an intelligentelectrical apparatus, a smart monitoring device, a smart television, asmart video camera, an interphone, or the like, or any combinationthereof. In some embodiments, the wearable device may include a smartbracelet, a smart footgear, a smart glass, a smart helmet, a smartwatch, a smart clothing, a smart backpack, a smart accessory, or thelike, or any combination thereof. In some embodiments, the smart mobiledevice may include a smartphone, a personal digital assistance (PDA), agaming device, a navigation device, a point of sale (POS) device, or thelike, or any combination thereof. In some embodiments, the virtualreality device and/or the augmented reality device may include a virtualreality helmet, a virtual reality glass, a virtual reality patch, anaugmented reality helmet, an augmented reality glass, an augmentedreality patch, or the like, or any combination thereof. For example, thevirtual reality device and/or the augmented reality device may include aGoogle Glass, an Oculus Rift, a Hololens, a Gear VR, etc. In someembodiments, built-in device in the motor vehicle 130-4 may include anonboard computer, an onboard television, etc. In some embodiments, therequestor terminal 130 may be a device with positioning technology forlocating the position of the requestor and/or the requestor terminal130.

In some embodiments, the provider terminal 140 may be similar to, or thesame device as the requestor terminal 130. In some embodiments, theprovider terminal 140 may be a device with positioning technology forlocating the position of the provider and/or the provider terminal 140.In some embodiments, the requestor terminal 130 and/or the providerterminal 140 may communicate with other positioning device to determinethe position of the requestor, the requestor terminal 130, the provider,and/or the provider terminal 140. In some embodiments, the requestorterminal 130 and/or the provider terminal 140 may send positioninginformation to the server 110.

The database 150 may store data and/or instructions. In someembodiments, the database 150 may store data obtained from the requestorterminal 130 and/or the provider terminal 140. In some embodiments, thedatabase 150 may store data and/or instructions that the server 110 mayexecute or use to perform exemplary methods described in the presentdisclosure. In some embodiments, database 150 may include a massstorage, a removable storage, a volatile read-and-write memory, aread-only memory (ROM), or the like, or any combination thereof.Exemplary mass storage may include a magnetic disk, an optical disk, asolid-state drives, etc. Exemplary removable storage may include a flashdrive, a floppy disk, an optical disk, a memory card, a zip disk, amagnetic tape, etc. Exemplary volatile read-and-write memory may includea random access memory (RAM). Exemplary RAM may include a dynamic RAM(DRAM), a double date rate synchronous dynamic RAM (DDR SDRAM), a staticRAM (SRAM), a thyristor RAM (T-RAM), and a zero-capacitor RAM (Z-RAM),etc. Exemplary ROM may include a mask ROM (MROM), a programmable ROM(PROM), an erasable programmable ROM (PEROM), an electrically erasableprogrammable ROM (EEPROM), a compact disk ROM (CD-ROM), and a digitalversatile disk ROM, etc. In some embodiments, the database 150 may beimplemented on a cloud platform. Merely by way of example, the cloudplatform may include a private cloud, a public cloud, a hybrid cloud, acommunity cloud, a distributed cloud, an inter-cloud, a multi-cloud, orthe like, or any combination thereof.

In some embodiments, the database 150 may be connected to the network120 to communicate with one or more components in the on-demand servicesystem 100 (e.g., the server 110, the requestor terminal 130, theprovider terminal 140, etc.). One or more components in the on-demandservice system 100 may access the data or instructions stored in thedatabase 150 via the network 120. In some embodiments, the database 150may be directly connected to or communicate with one or more componentsin the on-demand service system 100 (e.g., the server 110, the requestorterminal 130, the provider terminal 140, etc.). In some embodiments, thedatabase 150 may be part of the server 110.

In some embodiments, one or more components in the on-demand servicesystem 100 (e.g., the server 110, the requestor terminal 130, theprovider terminal 140, etc.) may have a permission to access thedatabase 150. In some embodiments, one or more components in theon-demand service system 100 may read and/or modify information relatingto the requestor, provider, and/or the public when one or moreconditions are met. For example, the server 110 may read and/or modifyone or more users' information after a service. As another example, theprovider terminal 140 may access information relating to the requestorwhen receiving a service request from the requestor terminal 130, butthe provider terminal 140 may not modify the relevant information of therequestor.

In some embodiments, information exchanging of one or more components inthe on-demand service system 100 may be achieved by way of requesting aservice. The object of the service request may be any product. In someembodiments, the product may be a tangible product, or an immaterialproduct. The tangible product may include food, medicine, commodity,chemical product, electrical appliance, clothing, car, housing, luxury,or the like, or any combination thereof. The immaterial product mayinclude a servicing product, a financial product, a knowledge product,an internet product, or the like, or any combination thereof. Theinternet product may include an individual host product, a web product,a mobile internet product, a commercial host product, an embeddedproduct, or the like, or any combination thereof. The mobile internetproduct may be used in a software of a mobile terminal, a program, asystem, or the like, or any combination thereof. The mobile terminal mayinclude a tablet computer, a laptop computer, a mobile phone, a personaldigital assistance (PDA), a smart watch, a point of sale (POS) device,an onboard computer, an onboard television, a wearable device, or thelike, or any combination thereof. For example, the product may be anysoftware and/or application used in the computer or mobile phone. Thesoftware and/or application may relate to socializing, shopping,transporting, entertainment, learning, investment, or the like, or anycombination thereof. In some embodiments, the software and/orapplication relating to transporting may include a traveling softwareand/or application, a vehicle scheduling software and/or application, amapping software and/or application, etc. In the vehicle schedulingsoftware and/or application, the vehicle may include a horse, acarriage, a rickshaw (e.g., a wheelbarrow, a bike, a tricycle, etc.), acar (e.g., a taxi, a bus, a private car, etc.), a train, a subway, avessel, an aircraft (e.g., an airplane, a helicopter, a space shuttle, arocket, a hot-air balloon, etc.), or the like, or any combinationthereof.

FIG. 2 is a schematic diagram illustrating exemplary hardware andsoftware components of a computing device 200 on which the server 110,the requestor terminal 130, and/or the provider terminal 140 may beimplemented according to some embodiments of the present disclosure. Forexample, the processing engine 112 may be implemented on the computingdevice 200 and configured to perform functions of the processing engine112 disclosed in this disclosure.

The computing device 200 may be a general purpose computer or a specialpurpose computer, both may be used to implement an on-demand system forthe present disclosure. The computing device 200 may be used toimplement any component of the on-demand service as described herein.For example, the processing engine 112 may be implemented on thecomputing device 200, via its hardware, software program, firmware, or acombination thereof. Although only one such computer is shown, forconvenience, the computer functions relating to the on-demand service asdescribed herein may be implemented in a distributed fashion on a numberof similar platforms, to distribute the processing load.

The computing device 200, for example, may include COM ports 250connected to and from a network connected thereto to facilitate datacommunications. The computing device 200 may also include a centralprocessing unit (CPU) 220, in the form of one or more processors, forexecuting program instructions. The exemplary computer platform mayinclude an internal communication bus 210, program storage and datastorage of different forms, for example, a disk 270, and a read onlymemory (ROM) 230, or a random access memory (RAM) 240, for various datafiles to be processed and/or transmitted by the computer. The exemplarycomputer platform may also include program instructions stored in theROM 230, RAM 240, and/or other type of non-transitory storage medium tobe executed by the CPU 220. The methods and/or processes of the presentdisclosure may be implemented as the program instructions. The computingdevice 200 also includes an I/O component 260, supporting input/outputbetween the computer and other components therein such as user interfaceelements 280. The computing device 200 may also receive programming anddata via network communications.

Merely for illustration, only one CPU and/or processor is described inthe computing device 200. However, it should be note that the computingdevice 200 in the present disclosure may also include multiple CPUsand/or processors, thus operations and/or method steps that areperformed by one CPU and/or processor as described in the presentdisclosure may also be jointly or separately performed by the multipleCPUs and/or processors. For example, if in the present disclosure theCPU and/or processor of the computing device 200 executes both step Aand step B, it should be understood that step A and step B may also beperformed by two different CPUs and/or processors jointly or separatelyin the computing device 200 (e.g., the first processor executes step Aand the second processor executes step B, or the first and secondprocessors jointly execute steps A and B).

FIG. 3 is a block diagram illustrating an exemplary architecture ofprocessing engine 112 according to some embodiments of the presentdisclosure. As illustrated, processing engine 112 may include a requestobtaining unit 310, a provider information obtaining unit 320, anassignment strategy generation unit 330 and an assignment unit 340.

Request obtaining unit 310 may be configured to obtain a transactionrequest associated with a transportation service from a servicereceiver. In some embodiments, the transportation service may be aservice of taking an object from one place to another in a vehicle. Theobject may include passengers and/or goods. The vehicle may include anon-motor vehicle (e.g., a bicycle or a tricycle), a motor vehicle(e.g., a car or a truck), a watercraft (e.g., a ship or a boat) and/oran aircraft. For example, the transportation service may be a taxiservice or a delivery service.

In some embodiments, the transaction request of the service receiver mayinclude an origin of the transaction request (e.g., a pickup location ofa taxi service), a destination of the transaction request, receivercontact information (e.g., a phone number and/or an email address),object information (e.g., the number of passengers and/or the volume ofgoods), information of whether to agree to combine the transportationservice with another transportation service, or the like, or anycombination thereof.

Provider information obtaining unit 320 may be configured to obtainservice provider information of a service provider. In some embodiments,the service provider information may include a location of the serviceprovider, provider contact information (e.g., a phone number and/or anemail address), the name of the service provider, the plate number ofthe service provider, the capacity of the service provider (e.g., thepassenger capacity and/or the goods capacity), or the like, or anycombination thereof.

In some embodiments, the service provider and/or the service receivermay use a device to communicate with the on-demand service system 100through network 120. The device may include a desktop, an All-in-Onepersonal computer (AIO), a notebook, a smartphone, a Personal DigitalAssistant (PDA), a tablet, a carputer, a handheld game player, awearable device (e.g., smart glasses or smartwatch), a virtual displaydevice (e.g., Oculus Rift or Gear VR), a augmented display device (e.g.,Google Glass, Hololens), or the like, or any combination thereof.

Assignment strategy generation unit 330 may be configured to generate anassignment strategy associated with combining two or more transportationservices into a new transportation service. In some embodiments, theassignment strategy may include a first strategy that is to combine thetwo or more transportation services into a new transportation serviceand/or a second strategy that is not to combine the two or moretransportation services into a new transportation service.

Assignment unit 340 may be configured to send the assignment strategy toat least one of the service provider or the two or more servicereceivers.

The modules in the processing engine 112 may be connected to orcommunicate with each other via a wired connection or a wirelessconnection. The wired connection may include a metal cable, an opticalcable, a hybrid cable, or the like, or any combination thereof. Thewireless connection may include a Local Area Network (LAN), a Wide AreaNetwork (WAN), a Bluetooth, a ZigBee, a Near Field Communication (NFC),or the like, or any combination thereof. Two or more of the modules maybe combined as a single module, and any one of the modules may bedivided into two or more units. For example, the acquisition module 302may be integrated in the determination module 304 as a single modulewhich may both obtain features of orders and determine matchinginformation of the orders.

FIG. 4 is a flowchart illustrating an exemplary process of a carpoolservice according to some embodiments of the present disclosure. Thecarpool service may refer to an arrangement that combines two or moretransportation services into a new transportation service. In thisdisclosure, a carpool service of combining two transportation servicesinto a new transportation service is taken for example. It should benoted that the carpool service of combining two transportation servicesinto a new transportation service is merely provided for the purposes ofillustration, and not intended to limit the scope of the presentdisclosure. In some embodiments, this disclosure may be applied to acarpool service of combining more than two transportation services intoa new transportation service.

In step 410, request obtaining unit 310 may obtain a first transactionrequest requesting a first transportation service. The request obtainingunit 310 may receive the first transaction request from a first servicereceiver at a first time point.

In step 420, request obtaining unit 310 may obtain a second transactionrequest requesting a second transportation service. The requestobtaining unit 310 may receive the second transaction request from asecond service receiver at a second time point.

In some embodiments, the first transportation service and the secondtransportation service may be of the same type of services. For example,both the first transportation service and the second transportationservice may be taxi service. In some embodiments, the firsttransportation service and the second transportation service may bedifferent type of services. For example, the first transportationservice may be a taxi service, and the second transportation service maybe a freight shipping service.

In some embodiments, the first transaction request may include a firstorigin and/or a first destination, and the second transaction requestmay include a second origin and/or a second destination.

In some embodiments, the first time point may be earlier than the secondtime point. In some embodiments, the first time point may be later thanthe second time point. In some embodiments, the first time point may beequal to the second time point.

The first transaction request and/or the second transaction request mayinclude a real-time transaction request, an appointment transactionrequest, or a pending transaction request. As used herein, a real-timetransaction request may be a transaction request that the requestorwishes to conduct the requested transaction (e.g., transportationservice) at the present moment or at a defined time reasonably close tothe present moment for an ordinary person in the art. For example, atransaction request may be a real-time transaction request if thedefined time is shorter than a threshold value, such as 1 minute, 5minutes, 10 minutes or 20 minutes. The appointment transaction requestmay refer to that the requestor wishes to conduct the requestedtransaction at a defined time which is reasonably far from the presentmoment for the ordinary person in the art. For example, a transactionrequest may be an appointment transaction request if the defined time islonger than a threshold value, such as 20 minutes, 2 hours, or 1 day. Insome embodiments, the processing engine 112 may define the real-timetransaction request or the appointment transaction request based on atime threshold. The time threshold may be default settings of the system100, or may be adjustable depending on different situations. Forexample, in a traffic peak period, the time threshold may be relativelysmall (e.g., 10 minutes), otherwise in idle period (e.g., 10:00-12:00am), the time threshold may be relatively large (e.g., 1 hour). Thepending transaction request may be an on-going transaction request whichhas not yet been accepted by a service provider at the present moment.

In some embodiments, suppose that the first time point is earlier thanthe second time point, the first transaction request has been acceptedby a service provider and the second transaction request has not beenaccepted, request obtaining unit 310 may obtain a second transactionrequest of which the origin is in a certain area according to thelocation of the service provider at the first time. For example, thedistance between the second origin and the location of the serviceprovider at the first time point may be less than a first threshold(e.g., 3 kilometer). As another example, if the location of the serviceprovider at the first time point is in, for example, Manhattan, New YorkCity, request obtaining unit 310 may obtain a second transaction requestof which the origin is in Manhattan.

In some embodiments, suppose that the first time point is later than thesecond time point, the first transaction request has been accepted by aservice provider and the second transaction request has not beenaccepted, request obtaining unit 310 may obtain a first transactionrequest of which the location of the service provider at the first timeis in a certain area according to the origin of the second transactionrequest. For example, the distance between the second origin and thelocation of the service provider at the first time point may be lessthan a first threshold (e.g., 3 kilometer). As another example, if theorigin of the second transaction request is in, for example, Manhattan,request obtaining unit 310 may obtain a first transaction request ofwhich the location of the service provider at the first time point is inManhattan.

In some embodiments, if there are no transaction requests in the certainarea, request obtaining unit 310 may obtain a transaction request inanother area. Additionally or alternatively, request obtaining unit 310may obtain a transaction request after a period of time (e.g., 1minute).

Alternatively, request obtaining unit 310 may obtain transactionrequests in any area.

In some embodiments, the transaction request may include information ofwhether the requestor agrees to combine the transportation service withanother transportation service. Accordingly, request obtaining unit 310may obtain a transaction request that agrees to combine thetransportation service with another transportation service. However, ifthe transaction request does not include the information of whether toagree to combine the transportation service with another transportationservice, after obtaining the transaction request, the on-demand servicesystem 100 may send a message to the service receiver to determinewhether the service receiver agrees to combine the transportationservice with another transportation service.

In step 430, provider information obtaining unit 320 may obtain serviceprovider information of a service provider. The location of the serviceprovider may include a first location at the first time point and/or asecond location at the second time point. The first location at thefirst time point may be the location of the service provider when thefirst transaction request is obtained by request obtaining unit 310, andthe second location at the second time point may be the location of theservice provider when the second transaction request is obtained byrequest obtaining unit 310.

In step 440, assignment strategy generation unit 330 may generate anassignment strategy to combine the first transportation service and thesecond transportation service into a third transportation service.

In some embodiments, the assignment strategy may include a firststrategy or a second strategy. The first strategy may include combiningthe first transportation service and the second transportation serviceinto the third transportation service. It may include the first origin,the first destination, the second origin, the second destination, theservice receiver information, the service provider information, or thelike, or any combination thereof. Under the second strategy, the firsttransportation service and the second transportation service may not becombined into the third transportation service. The second strategy mayinstead include combining the first transportation service or the secondtransportation service with a fourth transportation service associatedwith a fourth transaction request. Alternatively or additionally, thesecond strategy may include assigning the first transaction request orthe second transaction request to an idle service provider, i.e., aservice provider that is not serving anyone.

In step 450, assignment unit 340 may send the assignment strategy to atleast one of the service provider, the first service receiver or thesecond service receiver.

In some embodiments, assignment strategy generation unit 330 maydetermine whether two pending transaction requests are combinable. Forexample, the first transaction request and the second transactionrequest may be pending transaction requests. In some embodiments,assignment strategy generation unit 330 may determine whether anacceptable transaction request and a pending transaction request arecombinable. For example, the first transaction request may be anacceptable transaction request, and the second transaction request maybe a pending transaction request. Here, the accepted request may referto a transaction request that has been accepted by a service provider.The pending request may refer to a transaction request that has not beenaccepted by a service provider

In some embodiments, request obtaining unit 310 may obtain one acceptedtransaction request and one pending transaction request. Assignmentstrategy generation unit 330 may determine whether the twotransportation services associated with the two transaction requests arepossible to be combined into a new transportation service. If the answeris “yes”, that is, the two transportation service associated with thetwo transaction requests is possible to be combined into a newtransportation service, assignment strategy generation unit 330 maygenerate the first strategy. If the answer is “no”, that is, the twotransportation service associated with the two transaction requests isnot possible to be combined into a new transportation service,assignment strategy generation unit 330 may generate the secondstrategy, and/or request obtaining unit 310 may obtain another acceptedrequest and/or another pending request.

In some embodiments, request obtaining unit 310 may obtain one acceptedtransaction request and more than one pending transaction requests.Assignment strategy generation unit 330 may select a pending transactionrequest from the more than one pending transaction requests. Theon-demand service system 100 may combine the transportation serviceassociated with the selected pending transaction request with thetransportation service associated the accepted transaction.

In some embodiments, request obtaining unit 310 may obtain one pendingtransaction request and more than one accepted transaction requests.Assignment strategy generation unit 330 may select an acceptedtransaction request from the more than one accepted transactionrequests. The on-demand service system 100 may combine thetransportation service associated with the selected accepted transactionrequest with the transportation service associated with the pendingtransaction request.

In some embodiments, request obtaining unit 310 may obtain two or morepending transaction requests. Assignment strategy generation unit 330may select one or more first groups of pending requests. The first groupof pending requests may include two pending requests with which the twotransportation services associated are used to be combined into a newtransportation service.

In some embodiments, assignment strategy generation unit 330 may selectand determine a service provider to provide the new transportationservice to the first group. In some embodiments, request obtaining unit310 may obtain more than one pending transaction requests and more thanone accepted requests. Assignment strategy generation unit 330 maydetermine one or more second group. The second group may include onepending transaction request and one accepted transaction request. Thetransportation service associated with the pending transaction requestand the transportation service associated with the accepted transactionrequest may be combined into a new transportation service.

FIG. 5 is a block diagram illustrating an exemplary architecture of anassignment strategy generation unit 330 according to some embodiments ofthe present disclosure. As illustrated, assignment strategy generationunit 330 may include a matching information determination block 510, amatching result generation block 520, a ranking result generation block530 and a strategy generation block 540.

Matching information determination block 510 may be configured todetermine matching information. In some embodiments, the matchinginformation may be used to determine a candidate transaction request ofa service receiver associated with a transportation service that ispossible to be combined with another transportation service. In someembodiments, the matching information may include a variation in traveldirection of the service provider which has accepted the firsttransaction request when the service provider goes to an origin of atransaction request, direction information, route information, amatching probability, a ratio between an estimated travel timeassociated with the third transportation service (i.e., the combinedtransportation transaction of the first transportation service and thesecond transportation service) and an estimated travel time associatedwith the first transportation service, or the like, or any combinationthereof.

In some embodiments, matching information determination block 510 mayinclude a plurality of sub-blocks configured to determine the matchinginformation. For example, matching information determination block 510may include a variation sub-block 511, a direction and route sub-block513, a matching probability sub-block 515 and an estimated timesub-block 517. Variation sub-block 511 may configured to determine avariation in travel direction of the service provider which has acceptedthe first transaction request when the service provider goes to anorigin of a transaction request. Direction and route sub-block 513 maybe configured to determine direction information and route information.Matching probability sub-block 515 may be configured to determine amatching probability. Estimated time sub-block 517 may be configured todetermine a ratio between an estimated travel time associated with thethird transportation service and an estimated travel time associatedwith the first transportation service. In some embodiments, matchinginformation determination block 510 may include other sub-blocksconfigured to determine other matching information.

Matching result generation block 520 may be configured to generate amatching result according to the matching information. In someembodiments, the matching result may be a group of candidate transactionrequests of service receivers.

Ranking result generation block 530 may be configured to generation aranking result according to the matching result. In some embodiments,the ranking result may be a transaction request of a service receiverassociated with a transportation service that is used to combine withanother transportation service. The transaction request of the rankingresult may be selected from the matching result.

Strategy generation block 540 may be configured to generate anassignment strategy according to the ranking result.

FIG. 6 is a flowchart illustrating an exemplary process of generating anassignment strategy according to some embodiments of the presentdisclosure. In some embodiments, process 600 may generate the assignmentstrategy in step 440 of process 400.

In step 610, matching information determination block 510 may determinematching information according to the first transaction request and thesecond transaction request. In some embodiments, the matchinginformation may be used to determine a candidate transaction request ofa service receiver associated with a transportation service that ispossible to be combined with another transportation service. In someembodiments, the matching information may include a variation in traveldirection of the service provider which has accepted the firsttransaction request when the service provider goes to an origin of atransaction request, direction information, route information, amatching probability, a ratio between an estimated travel timeassociated with the third transportation service and an estimated traveltime associated with the first transportation service, or the like, orany combination thereof. In some embodiments, the matching informationmay be determined according to at least one of the location of theservice provider, the first origin, the first destination, the secondorigin or the second destination.

In step 620, matching result generation block 520 may generate amatching result according to the matching information. In someembodiments, the matching result may be generated by determining whetherthe matching information satisfies one or more conditions. For example,if the matching information of a transaction request is the matchingprobability, the condition may be that the matching probability ishigher than a second threshold. If the matching probability is higherthan the second threshold, the transaction request may be regarded as acandidate transaction request. As another example, if the matchinginformation of a transaction request is the ratio between an estimatedtravel time associated with the third transportation service and anestimated travel time associated with the first transportation service,the condition may be that the ratio is less than a third threshold. Ifthe ratio is less than the third threshold, the transaction request maybe regarded as a candidate transaction request.

In some embodiments, if request obtaining unit 310 obtains one acceptedtransaction request and more than one pending transaction requests,matching result generation block 520 may select one or more candidatetransaction requests from the more than one pending transactionrequests. If request obtaining unit 310 obtains one pending transactionrequest and more than one accepted transaction requests, matching resultgeneration block 520 may select one or more candidate transactionrequests from the more than one accepted transaction requests.

In some embodiments, if there is no candidate transaction request in thematching result, request obtaining unit 310 may obtain one or moretransaction requests in another area. Additionally or alternatively,request obtaining unit 310 may obtain one or more transaction requestsafter a period of time (e.g., after 1 minute).

In step 630, ranking result generation block 530 may generate a rankingresult according to the matching result. In some embodiments, thecandidate transaction requests in the matching result may be ranked. Forexample, if the matching information is the matching probability, theranking result may be the transaction request of which the matchingprobability is the highest. As another example, if the matchinginformation is the direction information and the route information, ascore may be determined according to the direction information, theroute information, a weight of the direction information and a weight ofthe route information. The ranking result may be the transaction requestof which the score is the highest.

In some embodiments, if the number of the candidate transaction requestsin the matching result is less than or equal to 1, step 630 may beomitted.

In step 640, strategy generation block 540 may generate an assignmentstrategy according to the ranking result. In some embodiments, a firststrategy that is to combine the first transportation service and thesecond transportation service into the third transportation service maybe generated according to the ranking result. A second strategy that isnot to combine the first transportation service and the secondtransportation service into the third transportation service may begenerated according to other transaction requests obtained by requestobtaining unit 310. The other transaction requests may be combined witha fourth transaction request associated with a fourth transportationservice or be assigned to a service provider that is not providing atransportation service.

FIG. 7 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure. In some embodiments, process 700 may be used for determiningthe matching information in 610 of process 600.

In this case, the first transaction request may be obtained at the firsttime point, and the second transaction request may be obtained at thesecond time point. The first time point may be earlier than the secondtime point. The first transaction request may be an accepted request atthe second time point, and the second transaction request may be apending transaction request at the second time point.

In step 710, variation sub-block 511 may determine a first routeaccording to the first location of the service provider that accepts thefirst transaction request and the first destination.

In step 720, variation sub-block 511 may determine a second routeaccording to the second origin and the second destination.

In some embodiments, if there are more than one routes according to thefirst location of the service provider and the first destination oraccording to the second origin and the second destination, variationsub-block 511 may select one route that satisfies a condition. Thecondition may include that the length of the route is the shortest, thetraveling time of the route is the least, the traffic lights in theroute are least, or the like, or any combination thereof.

In step 730, variation sub-block 511 may determine whether there is anyoverlapping part between the first route and the second route. If theanswer is “yes”, that is, there is at least one overlapping part betweenthe first route and the second route, the process may proceed to step740. If the answer is “no”, that is, there is no overlapping partbetween the first route and the second route, the process may proceed tostep 770 to generate a second strategy that is not to combine the firsttransportation service associated with the first transaction request andthe second transportation service associated with the second transactionrequest into the third transportation service by strategy generationblock 540.

In step 740, variation sub-block 511 may determine a variation in traveldirection of the service provider which has accepted the firsttransaction request when the service provider goes to the second originaccording to the first route and the second route. In some embodiments,the service provider may change the travel direction to pick up thesecond service receiver from the second origin. As illustrated in FIG.8, if the service provider is in the location of A₁ when requestobtaining unit 310 obtains the second transaction request at the secondtime point, the variation in travel direction of the service providermay be 180° (e.g., a U-turn) when the service provider goes to thesecond origin B₁ or B₂. If the service provider is in the location of A₂when request obtaining unit 310 obtains the second transaction requestat the second time point, the variation in travel direction of theservice provider may be 0° when the service provider goes to the secondorigin B₁ or B₂. As illustrated in FIG. 9, if the service provider is inthe location of A₃ when request obtaining unit 310 obtains the secondtransaction request at the second time point, the variation in traveldirection of the service provider may be a when the service providergoes to the second origin B₃, and the variation in travel direction ofthe service provider may be 180−α when the service provider goes to thesecond origin service provider goes to the second origin B₄. If theservice provider is in the location of A₄ when request obtaining unit310 obtains the second transaction request at the second time point, thevariation in travel direction of the service provider may be 360°−α whenthe service provider goes to the second origin B₃, and the variation intravel direction of the service provider may be 180°+α when the serviceprovider goes to the second origin B₄. It should be noted that thedescription in FIG. 8 and FIG. 9 is merely provided for the purposes ofillustration, and not intended to limit the scope of the presentdisclosure.

In step 750, matching result generation block 520 may determine whetherthe variation is less than a third threshold. If the answer is “yes”,that is, the variation is less than the third threshold, the process mayproceed to step 760 to generate a matching result by matching resultgeneration block 520. If the answer is “no”, that is, the variation islarger than or equal to the third threshold, the process may proceed tostep 770. In some embodiments, the third threshold may be 180°.

In some embodiments, the variation may be determined by a variationmodel. The variation model may be obtained by training historical datain a period of time. The historical data may be one or more transactionrequests associated with one or more transportation services that aresuccessfully combined with some other transportation services. Theperiod of time may include 1 hour, 1 day, 2 days, 1 week, 1 month, orthe like. In some embodiments, the variation model may be obtained byusing a linear regression model to train the historical data in a periodof time. The linear regression model may include a logistic regressionmodel, a support vector machine model (SVM), a least square model, orthe like, or any combination thereof. The logistic regression model maybe represented as Equation (1) and Equation (2) as below:

$\begin{matrix}{{{P\left( {Y = {\left. 1 \middle| X \right. = x}} \right)} = \frac{1}{1 + e^{{- W}*x}}},} & {{Equation}\mspace{14mu}(1)} \\{{{P\left( {Y = {\left. 0 \middle| X \right. = x}} \right)} = {1 - \frac{1}{1 + e^{{- W}*x}}}},} & {{Equation}\mspace{14mu}(2)}\end{matrix}$wherein, in this case, X is a variation variable, and refers to thevariation in travel direction of the service provider when the serviceprovider goes to the second origin, Y is a target variable, the equationY=1 refers that the first transportation service associated with thefirst transaction request and the second transportation serviceassociated with the second transaction request are combined into thethird transportation service, the equation Y=0 refers that the firsttransportation service associated with the first transaction request andthe second transportation service associated with the second transactionrequest are not combined into the third transportation service, P refersto a probability that the first transportation service associated withthe first transaction request and the second transportation serviceassociated with the second transaction request are not combined into thethird transportation service, and W refers to a regression coefficient.

In some embodiments, steps 740 and 750 may be performed after step 720,and step 730 may be performed after step 730. In some embodiments, step710 and step 720 may be performed in any order. Step 710 may beperformed before step 720. Step 710 may be performed after step 720.Step 710 and step 720 may be performed at the same time. In someembodiments, process 700 may further include a step of determiningwhether the length of the overlapping part is larger than a fourththreshold. In some embodiments, step 730 may be omitted.

FIG. 10 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure. In some embodiments, process 1000 may be used fordetermining the matching information in 610 of process 600.

In this case, the first transaction request may be obtained at the firsttime point, and the second transaction request may be obtained at thesecond time point. The first time point may be earlier than or equal tothe second time point. The first transaction request may be an acceptedrequest or a pending request at the second time point, and the secondtransaction request may be a pending transaction request at the secondtime point.

In step 1010, direction and route sub-block 513 may determine directioninformation and route information according to the first transactionrequest and the second transaction request. In some embodiments, thedirection information may include a first direction of the firsttransaction request, a second direction of the second transactionrequest, a first angle between the first direction and the seconddirection, or the like, or any combination thereof. The routeinformation may include a first sharing route, a first original route, asecond sharing route, a second original route, the length of the firstsharing route, the length of the first original route, the length of thesecond sharing route, the length of the second original route, a firstratio of the length of the first sharing route to the length of thefirst original route, a second ratio of the length of the second sharingroute to the length of the second original route, or the like, or anycombination thereof. In some embodiments, the first original route maybe a route from the first origin to the first destination in the firsttransportation service, the second original route may be a route fromthe second origin to the second destination in the second transportationservice, the first sharing route may be a route from the first origin tothe first destination in the third transportation service, and thesecond sharing route may be a route from the second origin to the seconddestination in the third transportation service.

In step 1020, matching result generation block 520 may generate amatching result according to the direction information and the routeinformation.

FIG. 11 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure. In some embodiments, process 1100 may be used fordetermining the direction information and the route information in 1010of process 1000 and generating the matching result in 1020 of process1000.

In step 1110, direction and route sub-block 513 may determine a firstdirection of the first transaction request, a second direction of thesecond transaction request, a first sharing route, a first originalroute, a second sharing route and a second original route according tothe first transaction request and the second transaction request.

In some embodiments, a direction of a transaction request may be avector determined by the origin of the transaction request and thedestination of the transaction request, and the direction of the vectormay be from the origin to the destination. The first direction may bedetermined according to the first origin and the first destination, andthe second direction may be determined according to the second originand the second destination.

The first original route may be determined according to the first originand the first destination. The second original route may be determinedaccording to the second origin and the second destination.

If the on-demand transportation service system 100 determine to combinethe first transportation service associated with the first transactionrequest with the second transportation service associated with thesecond transaction request, the system 100 may determine a sharing routeaccording to the first origin, the first destination, the second originand the second destination. The sharing route may include the firstsharing route and the second sharing route.

In step 1120, direction and route sub-block 513 may determine the lengthof the first sharing route, the length of the second sharing route, thelength of the first original route and the length of the second originalroute.

In step 1130, direction and route sub-block 513 may determine a firstangle between the first direction and the second direction, a firstratio of the length of the first sharing route to the length of thefirst original route, and a second ratio of the length of the secondsharing route to the length of the second original route. Here, thefirst ratio may be used to measure the extent of detour of the firsttransaction request when the first transportation service is combinedwith the second transportation service, and the second ratio may be usedto measure the extent of detour of the second transaction request whenthe first transportation service is combined with the secondtransportation service.

In step 1140, matching result generation block 520 may determine whetherthe first angle is less than a fifth threshold. If the answer is “yes”,that is, the first angle is less than the fifth threshold, the processmay proceed to step 1150. If the answer is “no”, that is, the firstangle is larger than or equal to the fifth threshold, the process mayproceed to step 1180 to generate a second strategy by strategygeneration block 540.

In step 1150, matching result generation block 520 may determine whetherthe first ratio is less than a sixth threshold. If the answer is “yes”,that is, the first ratio is less than the sixth threshold, the processmay proceed to step 1160. If the answer is “no”, that is, the firstratio is larger than or equal to the sixth threshold, the process mayproceed to step 1180 to generate a second strategy.

In step 1160, matching result generation block 520 may determine whetherthe second ratio is less than a seventh threshold. If the answer is“yes”, that is, the second ratio is less than the seventh threshold, theprocess may proceed to step 1170 to generate a matching result bymatching result generation block 520. If the answer is “no”, that is,the second ratio is larger than or equal to the seventh threshold, theprocess may proceed to step 1180 to generate a second strategy.

In some embodiments, step 1140, step 1150 and step 1160 may be performedin any order.

Steps 1110-1130 may be used for determining the direction informationand the route information in 1010 of process 1000. Steps 1140-1170 maybe used for generating the matching result in 1020 of process 1000.

FIG. 12 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure. In some embodiments, process 1200 may be used fordetermining the matching information in 610 of process 600.

In this case, the first transaction request may be obtained at the firsttime point, and the second transaction request may be obtained at thesecond time point. The first time point may be later than the secondtime point. The first transaction request may be an accepted request atthe second time point, and the second transaction request may be apending transaction request at the second time point.

In step 1210, matching probability sub-block 515 may obtain a firstparameter according to the first origin, the first destination, thesecond origin and the second destination.

In some embodiments, the first parameter may include the distancebetween the second location of the service provider and the firstorigin, the distance between the second location of the service providerand the first destination, a second angle between a third original routeand a fourth original route, a third ratio of the length of a thirdsharing route to the length of the third original route, and/or a fourthratio of the length of a fourth sharing route to the length of thefourth original route. The third original route may be determinedaccording to the first origin and the first destination. The fourthoriginal route may be determined according to the second origin and thesecond destination. The third sharing route may be determined accordingto the first origin, the first destination and the second origin. Thefourth sharing route may be determined according to the second origin,the second destination and the first destination.

In step 1220, matching probability sub-block 515 may obtain a providerweight corresponding to the first parameter. In some embodiments, theprovider weight may be obtained according to historical data orempirical data.

In step 1230, matching probability sub-block 515 may determine amatching probability according to the first parameter and the providerweight.

FIG. 13 is a flowchart illustrating an exemplary process of obtaining aprovider weight according to some embodiments of the present disclosure.In some embodiments, process 1300 may be used for obtaining the providerweight in 1220 of process 1200.

In step 1310, matching probability sub-block 515 may obtain a thirdtransaction request and a fourth transaction request. In someembodiments, the third transaction request may be associated with afourth transportation service, and the fourth transaction request may beassociated with a fifth transportation service. The fourthtransportation service may be successfully combined with the fifthtransportation service.

In step 1320, matching probability sub-block 515 may obtain a secondparameter according to the third transaction request and the fourthtransaction request.

In step 1330, matching probability sub-block 515 may determine theprovider weight according to the second parameter. In some embodiments,the provider weight may be determined by a weight model. The weightmodel may be obtained by training historical data in a period of time.The historical data may be one or more transaction requests associatedwith one or more transportation services that are successfully combinedwith some other transportation services. The period of time may include1 hour, 1 day, 2 days, 1 week, 1 month, or the like. In someembodiments, the weight model may be obtained by using a linearregression model to train the historical data in a period of time. Thelinear regression model may include a logistic regression model, asupport vector machine model (SVM), a least square model, or the like,or any combination thereof. The logistic regression model may berepresented as Equation (1) and Equation (2), wherein, in this case, Xis a variation variable, and refers to the second parameter, Y is atarget variable, the equation Y=1 refers that the first transportationservice associated with the first transaction request and the secondtransportation service associated with the second transaction requestare combined into the third transportation service, the equation Y=0refers that the first transportation service associated with the firsttransaction request and the second transportation service associatedwith the second transaction request are not combined into the thirdtransportation service, P refers to a probability that the firsttransportation service associated with the first transaction request andthe second transportation service associated with the second transactionrequest are not combined into the third transportation service, and Wrefers to a regression coefficient.

FIG. 14 is a flowchart illustrating an exemplary process of determiningmatching information according to some embodiments of the presentdisclosure. In some embodiments, process 1400 may be used fordetermining the matching information in 610 of process 600.

In this case, the first transaction request may be obtained at the firsttime point, and the second transaction request may be obtained at thesecond time point. The first time point may be earlier than the secondtime point. The first transaction request may be an accepted request atthe second time point, and the second transaction request may be apending transaction request at the second time point.

In step 1410, estimated time sub-block 517 may determine a fifth routeaccording to at least one of the first location of the service provider,the first origin, the second destination, the first origin and/or thefirst destination.

In step 1420, estimated time sub-block 517 may determine a sixth routeaccording to the second location of the service provider, the secondorigin and the first destination. In some embodiments, when determiningthe fifth route and/or the sixth route, if there are more than oneroutes, estimated time sub-block 517 may select one route that satisfiesa condition. The condition may include that the length of the route isthe shortest, the traveling time of the route is the least, the trafficlights in the route are least, or the like, or any combination thereof.

In step 1430, estimated time sub-block 517 may determine an estimatedtime of the fifth route. In step 1440, estimated time sub-block 517 maydetermine an estimated time of the sixth route. In some embodiments, theestimated time may be determined by an estimated time model. Theestimated time model may be obtained by training historical data in aperiod of time. The historical data may be one or more transactionrequests associated with one or more transportation services that aresuccessfully combined with some other transportation services. Theperiod of time may include 1 hour, 1 day, 2 days, 1 week, 1 month, orthe like. In some embodiments, the estimated time model may be obtainedby using a linear regression model to train the historical data in aperiod of time. The linear regression model may include a logisticregression model, a support vector machine model (SVM), a least squaremodel, or the like, or any combination thereof. The logistic regressionmodel may be represented as Equation (1) and Equation (2), wherein, inthis case, X is a variation variable, and refers to the estimated timeof a route, Y is a target variable, the equation Y=1 refers that thefirst transportation service associated with the first transactionrequest and the second transportation service associated with the secondtransaction request are combined into the third transportation service,the equation Y=0 refers that the first transportation service associatedwith the first transaction request and the second transportation serviceassociated with the second transaction request are not combined into thethird transportation service, P refers to a probability that the firsttransportation service associated with the first transaction request andthe second transportation service associated with the second transactionrequest are not combined into the third transportation service, and Wrefers to a regression coefficient.

In step 1450, estimated time sub-block 517 may determine a fifth ratioof the estimated time of the sixth route to the estimated time of thefifth route. Here, the fifth ratio may be used to measure the extent ofdetour of the first transaction request when the first transportationservice is combined with the second transportation service.

In step 1460, matching result generation block 520 may determine whetherthe fifth ratio is less than an eighth threshold. If the answer is“yes”, the process may proceed to step 1470 to generate a matchingresult by matching result generation block 520. If the answer is “no”,the process may proceed to step 1480 to generate a second strategy bystrategy generation block 540.

In some embodiments, step 1410 and step 1420 may be performed in anyorder. In some embodiments, step 1410 and step 1420 may be performed atthe same time. In some embodiments, step 1430 and step 1440 may beperformed in any order. In some embodiments, step 1430 and step 1440 maybe performed at the same time. In some embodiments, step 1430 may beperformed before or after step 1420.

Steps 1410-1450 may be performed by estimated time sub-block 517. Steps1460-1470 may be performed by matching result generation block 520.

FIG. 15 is an exemplary diagram showing a fifth route and a sixth routeaccording to some embodiments of the present disclosure. As illustratedin FIG. 15, D₁ refers to the first location of the service provider, D₂refers to the second location of the service provider, E₁ refers to thefirst origin, E₂ refers to the first destination, F₁ refers to thesecond origin, F₂ refers to the second destination, R₁ refers to thefifth route, and R₂ refers to the sixth route.

It should be noted that the fifth route and the sixth route illustratedin FIG. 15 is merely provided for the purposes of illustration, and notintended to limit the scope of the present disclosure. For personshaving ordinary skills in the art, multiple variations or modificationsmay be made under the teachings of the present disclosure. However,those variations and modifications do not depart from the scope of thepresent disclosure. For example, in some embodiments, the fifth routemay include a route from the second location of the service provider D₂to the first destination E₂ in the first transportation service, and thesixth route may include a route from the second location of the serviceprovider D₂ to the second origin F₁ in the third transportation serviceand a route from the second origin F₁ to the first destination E₂ in thethird transportation service. As another example, in some embodiments,the fifth route may include a route from the first location of theservice provider D₁ to the first destination E₂ in the firsttransportation service, and the sixth route may include a route from thefirst location of the service provider D₁ to the first destination E₂ inthe third transportation service.

In some embodiments, the thresholds (e.g., the fourth threshold, thefifth threshold, or the like) mentioned in this disclosure may beobtained based on historical data, default settings of the on-demandservice system 100, or an instruction from a user.

Having thus described the basic concepts, it may be rather apparent tothose skilled in the art after reading this detailed disclosure that theforegoing detailed disclosure is intended to be presented by way ofexample only and is not limiting. Various alterations, improvements, andmodifications may occur and are intended to those skilled in the art,though not expressly stated herein. These alterations, improvements, andmodifications are intended to be suggested by this disclosure, and arewithin the spirit and scope of the exemplary embodiments of thisdisclosure.

Moreover, certain terminology has been used to describe embodiments ofthe present disclosure. For example, the terms “one embodiment,” “anembodiment,” and/or “some embodiments” mean that a particular feature,structure or characteristic described in connection with the embodimentis included in at least one embodiment of the present disclosure.Therefore, it is emphasized and should be appreciated that two or morereferences to “an embodiment” or “one embodiment” or “an alternativeembodiment” in various portions of this specification are notnecessarily all referring to the same embodiment. Furthermore, theparticular features, structures or characteristics may be combined assuitable in one or more embodiments of the present disclosure.

Further, it will be appreciated by one skilled in the art, aspects ofthe present disclosure may be illustrated and described herein in any ofa number of patentable classes or context including any new and usefulprocess, machine, manufacture, or composition of matter, or any new anduseful improvement thereof. Accordingly, aspects of the presentdisclosure may be implemented entirely hardware, entirely software(including firmware, resident software, micro-code, etc.) or combiningsoftware and hardware implementation that may all generally be referredto herein as a “unit,” “module,” or “system.” Furthermore, aspects ofthe present disclosure may take the form of a computer program productembodied in one or more computer readable media having computer readableprogram code embodied thereon.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including electro-magnetic, optical, or thelike, or any suitable combination thereof. A computer readable signalmedium may be any computer readable medium that is not a computerreadable storage medium and that may communicate, propagate, ortransport a program for use by or in connection with an instructionexecution system, apparatus, or device. Program code embodied on acomputer readable signal medium may be transmitted using any appropriatemedium, including wireless, wireline, optical fiber cable, RF, or thelike, or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of thepresent disclosure may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C++, C#, VB. NET,Python or the like, conventional procedural programming languages, suchas the “C” programming language, Visual Basic, Fortran 2003, Perl, COBOL2002, PHP, ABAP, dynamic programming languages such as Python, Ruby andGroovy, or other programming languages. The program code may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider) or in a cloud computing environment or offered as aservice such as a Software as a Service (SaaS).

Furthermore, the recited order of processing elements or sequences, orthe use of numbers, letters, or other designations therefore, is notintended to limit the claimed processes and methods to any order exceptas may be specified in the claims. Although the above disclosurediscusses through various examples what is currently considered to be avariety of useful embodiments of the disclosure, it is to be understoodthat such detail is solely for that purpose, and that the appendedclaims are not limited to the disclosed embodiments, but, on thecontrary, are intended to cover modifications and equivalentarrangements that are within the spirit and scope of the disclosedembodiments. For example, although the implementation of variouscomponents described above may be embodied in a hardware device, it mayalso be implemented as a software only solution, e.g., an installationon an existing server or mobile device.

Similarly, it should be appreciated that in the foregoing description ofembodiments of the present disclosure, various features are sometimesgrouped together in a single embodiment, figure, or description thereoffor the purpose of streamlining the disclosure aiding in theunderstanding of one or more of the various embodiments. This method ofdisclosure, however, is not to be interpreted as reflecting an intentionthat the claimed subject matter requires more features than areexpressly recited in each claim. Rather, claimed subject matter may liein less than all features of a single foregoing disclosed embodiment.

What is claimed is:
 1. A system for interacting with service receiversand service providers through an online transportation service platform,comprising: at least one first information exchange port of a servicereceiver system to communicate with a plurality of service receivers inthe service receiver system via networks; at least one secondinformation exchange port of a service provider system to communicatewith a plurality of service providers each associated with a vehicle inthe service provider system via the networks; a bus; one or more storagemedia electronically connected to the bus, including a set ofinstructions for operating an online sharable transportation platform;and logic circuits configured to communicate with the one or morestorage media via the bus, wherein when executing the set ofinstructions, the logic circuits are directed to automatically: receive,via the at least one first information exchange port a first transactionrequest from a first mobile terminal of a first service receiver of theplurality of service receivers, the first transaction request associatedwith a first transportation service at a first time point, the firsttransaction request including a first origin and a first destination;receive, via the at least one first information exchange port a secondtransaction request from a second mobile terminal of a second servicereceiver of the plurality of service receivers, the second transactionrequest associated with a second transportation service at a second timepoint, the second transaction request including a second origin and asecond destination; obtain service provider information of a third-partyservice provider of the plurality of service providers by tracking andreceiving real-time locations of the third-party service provider from apositioning system in a third mobile terminal of the third-party serviceprovider via the at least one second information exchange port;determine matching information online using one or more trained modelsbased on the first transaction request, the second transaction request,and the service provider information, the matching information includingat least one of a variation in a travel direction of the serviceprovider which has accepted the first transaction request when theservice provider goes to the second origin of the second transactionrequest, direction information, route information, a matchingprobability, or a ratio between an estimated travel time associated withthe third transportation service and an estimated travel time associatedwith the first transportation service; to determine the matchinginformation, the one or more trained models are configured to determinea probability to combine the first transportation service and the secondtransportation service into a third transportation service, the one ormore trained models being a logistic regression model including a targetvariable and a variation variable, the variation variable correspondingto the matching information, the target variable representing whether tocombine the first transportation service and the second transportationservice into the third transportation service, the one or more trainedmodels being trained by historical data including one or moretransaction requests that are successfully combined with some othertransaction requests; combine the first transportation service and thesecond transportation service into the third transportation serviceaccording to the matching information; interact with at least one of theservice receiver system or the service provider system by online sendingthe first origin, the first destination, the second origin, the seconddestination, and the provider information to at least one of the firstmobile terminal of the first service receiver in the service receiversystem, the second mobile terminal of the second service receiver in theservice receiver system or the third mobile terminal of the serviceprovider in the service provider system in real time, directing the atleast one of the first mobile terminal, the second mobile terminal, orthe third mobile terminal to display the first origin, the firstdestination, the second origin, the second destination, and the providerinformation on a map.
 2. The system of claim 1, wherein the serviceprovider information includes at least one of a first location of theservice provider at the first time point or a second location of theservice provider at the second time point.
 3. The system of claim 1,wherein the logic circuits are further directed to: determine a firstdirection of the first transaction request according to the first originand the first destination, a second direction of the second transactionrequest according to the second origin and the second destination, afirst sharing route of the first transaction request, a second sharingroute of the second transaction request, a first original route of thefirst transaction request and a second original route of the secondtransaction request, wherein the first sharing route is a route from thefirst origin to the first destination in the third transportationservice, and the second sharing route is a route from the second originto the second destination in the third transportation service; determinea length of the first sharing route, a length of the second sharingroute, a length of the first original route and a length of the secondoriginal route; determine a first angle between the first direction andthe second direction, a second ratio of the length of the first sharingroute to the length of the first original route and a third ratio of thelength of the second sharing route to the length of the second originalroute; and combine the first transportation service and the secondtransportation service into the third transportation service accordingto the first angle, the first ratio, and the second ratio.
 4. The systemof claim 2, wherein to determine the matching information using the oneor more trained models the logic circuits are further directed to:determine a first route according to the second location of the serviceprovider at the second time point and the first destination of the firsttransaction request; determine a second route according to the secondorigin of the second transaction request and the second destination ofthe second transaction request; and determine the variation in thetravel direction of the service provider when the service provider goesto the second origin of the second transaction request according to thefirst route and the second route.
 5. The system of claim 2, wherein todetermine the matching information using the one or more trained modelsthe logic circuits are further directed to: determine a third routeaccording to the second origin and the second destination and a fourthroute according to the second location of the service provider at thesecond time point and the first destination; obtain a first parameteraccording to the third route and the fourth route; obtain a providerweight; and determine a matching probability according to the firstparameter and the provider weight.
 6. The system of claim 5, wherein thefirst parameter includes at least one of a distance between the secondlocation of the service provider and the first origin, a distancebetween the second location of the service provider and the firstdestination, a second angle between the third route and the fourthroute, a fourth ratio of a length of a third sharing route of the firsttransaction request to a length of a third original route, or a fifthratio of a length of a fourth sharing route to a length of a fourthoriginal route.
 7. The system of claim 6, wherein to obtain the providerweight the logic circuits are further directed to: obtain a thirdtransaction request associated with a fourth transportation service anda fourth transaction request associated with a fifth transportationservice, the third transportation service and the fourth transportationservice being combined into a sixth transportation service that has beencompleted by the service provider; obtain a second parameter accordingto the third transaction request and the fourth transaction request; anddetermine the provider weight according to the second parameter.
 8. Thesystem of claim 2, wherein to determine the matching information usingthe one or more trained models the logic circuits are further directedto: determine a fourth route according to the first location of theservice provider; the first origin and the first destination; determinea first estimated time of the fourth route; determine a fifth routeaccording to at least one of the second location of the serviceprovider, the second origin, the second destination, the first origin orthe first destination; determine a second estimated time of the fifthroute; and determine the first ratio of the second estimated time to thefirst estimated time.
 9. A method for interacting with a plurality ofservice receivers and a plurality of service providers through an onlinetransportation service platform, comprising automatically: receiving, inreal time by a computer server of an online on-demand transportationservice platform from a first mobile terminal of a first servicereceiver of the plurality of service receivers via at least oneinformation exchange port of a service receiver system, a firsttransaction request associated with a first transportation service at afirst time point, the first transaction request including a first originand a first destination; receiving, in real time by the computer serverfrom a second mobile terminal of a second service receiver of theplurality of service receivers via the at least one information exchangeport of the service receiver system, a second transaction requestassociated with a second transportation service at a second time point,the second transaction request including a second origin and a seconddestination; obtaining, by the computer server via at least one secondinformation exchange port of a service provider system in real time,service provider information of a third-party service provider of theplurality of service providers by tracking and receiving real-timelocations of the third-party service provider from a positioning systemin a third mobile terminal of the third-party service provider;determine matching information online using one or more trained modelsbased on the first transaction request, the second transaction request,and the service provider information, the matching information includingat least one of a variation in a travel direction of the serviceprovider which has accepted the first transaction request when theservice provider goes to the second origin of the second transactionrequest, direction information, route information, a matchingprobability, or a ratio between an estimated travel time associated withthe third transportation service and an estimated travel time associatedwith the first transportation service; to determine the matchinginformation, the one or more trained models are configured to determinea probability to combine the first transportation service and the secondtransportation service into a third transportation service, the one ormore trained models being a logistic regression model including a targetvariable and a variation variable, the variation variable correspondingto the matching information, the target variable representing whether tocombine the first transportation service and the second transportationservice into the third transportation service, the one or more trainedmodels being trained by historical data including one or moretransaction requests that are successfully combined with some othertransaction requests; combining, by the computer server, the firsttransportation service and the second transportation service into thethird transportation service according to the matching information; andsending, by the computer server, the first origin, the firstdestination, the second origin, the second destination, and the providerinformation to at least one of the first mobile terminal of the firstservice receiver, the second mobile terminal of the second servicereceiver or the third mobile terminal of the service provider, directingthe at least one of the first mobile terminal, the second mobileterminal, or the third mobile terminal to display the first origin, thefirst destination, the second origin, the second destination, and theprovider information on a map.
 10. The method of claim 9, wherein theservice provider information includes at least one of a first locationof the service provider at the first time point or a second location ofthe service provider at the second time point.
 11. The method of claim9, further comprising: determining a first direction of the firsttransaction request according to the first origin and the firstdestination, a second direction of the second transaction requestaccording to the second origin and the second destination, a firstsharing route of the first transaction request, a second sharing routeof the second transaction request, a first original route of the firsttransaction request and a second original route of the secondtransaction request, wherein the first sharing route is a route from thefirst origin to the first destination in the third transportationservice, and the second sharing route is a route from the second originto the second destination in the third transportation service;determining a length of the first sharing route, a length of the secondsharing route, a length of the first original route and a length of thesecond original route; determining a first angle between the firstdirection and the second direction, a second ratio of the length of thefirst sharing route to the length of the first original route and athird ratio of the length of the second sharing route to the length ofthe second original route; and combining the first transportationservice and the second transportation service into the thirdtransportation service according to the first angle, the first ratio,and the second ratio.
 12. The method of claim 10, wherein thedetermining of the matching information using the one or more trainedmodels includes: determining a first route according to the secondlocation of the service provider at the second time point and the firstdestination of the first transaction request; determining a second routeaccording to the second origin of the second transaction request and thesecond destination of the second transaction request; and determiningthe variation in the travel direction of the service provider when theservice provider goes to the second origin of the second transactionrequest according to the first route and the second route.
 13. Themethod of claim 10, wherein the determining of the matching informationusing the one or more trained models includes: determining a third routeaccording to the second origin and the second destination and a fourthroute according to the second location of the service provider at thesecond time point and the first destination; obtaining a first parameteraccording to the third route and the fourth route; obtaining a providerweight; and determining a matching probability according to the firstparameter and the provider weight.
 14. The method of claim 13, whereinthe first parameter includes at least one of a distance between thesecond location of the service provider and the first origin, a distancebetween the second location of the service provider and the firstdestination, a second angle between the third route and the fourthroute, a fourth ratio of a length of a third sharing route of the firsttransaction request to a length of a third original route, or a fifthratio of a length of a fourth sharing route to a length of a fourthoriginal route.
 15. The method of claim 14, wherein the obtaining of theprovider weight includes: obtaining a third transaction requestassociated with a fourth transportation service and a fourth transactionrequest associated with a fifth transportation service, the thirdtransportation service and the fourth transportation service beingcombined into a sixth transportation service that has been completed bythe service provider; obtaining a second parameter according to thethird transaction request and the fourth transaction request; anddetermining the provider weight according to the second parameter. 16.The method of claim 10, wherein the determining of the matchinginformation using the one or more trained models includes: determining afourth route according to the first location of the service provider,the first origin and the first destination; determining a firstestimated time of the fourth route; determining a fifth route accordingto at least one of the second location of the service provider, thesecond origin, the second destination, the first origin or the firstdestination; determining a second estimated time of the fifth route; anddetermining the first ratio of the second estimated time to the firstestimated time.
 17. A non-transitory computer readable medium,comprising at least one set of instructions for interacting with aplurality of service receivers and a plurality of service providersthrough an online transportation service platform— wherein when executedby one or more processors of a computing device, the at least one set ofinstructions causes the computing device to perform a method, the methodcomprising automatically: receiving, in real time by a computer serverof an online on-demand transportation service platform from a firstmobile terminal of a first service receiver of the of service receiversvia at least one information exchange port of a service receiver system,a first transaction request associated with a first transportationservice at a first time point, the first transaction request including afirst origin and a first destination; receiving, in real time by thecomputer server from a second mobile terminal of a second servicereceiver of the plurality of service receivers via the at least oneinformation exchange port of the service receiver system, a secondtransaction request associated with a second transportation service at asecond time point, the second transaction request including a secondorigin and a second destination; obtaining, by the computer server viaat least one second information exchange port of a service providersystem in real time, service provider information of a third-partyservice provider of the plurality of service providers by tracking andreceiving real-time locations of the third-party service provider from apositioning system in a third mobile terminal of the third-party serviceprovider; determine matching information online using one or moretrained models based on the first transaction request, the secondtransaction request, and the service provider information, the matchinginformation including at least one of a variation in a travel directionof the service provider which has accepted the first transaction requestwhen the service provider goes to the second origin of the secondtransaction request, direction information, route information, amatching probability, or a ratio between an estimated travel timeassociated with the third transportation service and an estimated traveltime associated with the first transportation service; to determine thematching information, the one or more trained models are configured todetermine a probability to combine the first transportation service andthe second transportation service into a third transportation service,the one or more trained models being a logistic regression modelincluding a target variable and a variation variable, the variationvariable corresponding to the matching information, the target variablerepresenting whether to combine the first transportation service and thesecond transportation service into the third transportation service, theone or more trained models being trained by historical data includingone or more transaction requests that are successfully combined withsome other transaction requests; combining, by the computer server, thefirst transportation service and the second transportation service intothe third transportation service according to the matching information;and sending, by the computer server, the first origin, the firstdestination, the second origin, the second destination, and the providerinformation to at least one of the first mobile terminal of the firstservice receiver, the second mobile terminal of the second servicereceiver or the third mobile terminal of the service provider, directingthe at least one of the first mobile terminal, the second mobileterminal, or the third mobile terminal to display the first origin, thefirst destination, the second origin, the second destination, and theprovider information on a map.
 18. The non-transitory computer readablemedium of claim 17, wherein the determining of the matching informationusing the one or more trained models includes: determining a first routeaccording to the second location of the service provider at the secondtime point and the first destination of the first transaction request;determining a second route according to the second origin of the secondtransaction request and the second destination of the second transactionrequest; and determining the variation in the travel direction of theservice provider when the service provider goes to the second origin ofthe second transaction request according to the first route and thesecond route.
 19. The non-transitory computer readable medium of claim17, wherein the determining of the matching information using the one ormore trained models includes: determining a third route according to thesecond origin and the second destination and a fourth route according tothe second location of the service provider at the second time point andthe first destination; obtaining a first parameter according to thethird route and the fourth route; obtaining a provider weight; anddetermining a matching probability according to the first parameter andthe provider weight.
 20. The non-transitory computer readable medium ofclaim 17, wherein the determining of the matching information using theone or more trained models includes: determining a fourth routeaccording to the first location of the service provider, the firstorigin and the first destination; determining a first estimated time ofthe fourth route; determining a fifth route according to at least one ofthe second location of the service provider, the second origin, thesecond destination, the first origin or the first destination;determining a second estimated time of the fifth route; and determiningthe first ratio of the second estimated time to the first estimatedtime.